|
In modal logic, Sahlqvist formulas are a certain kind of modal formula with remarkable properties. The Sahlqvist correspondence theorem states that every Sahlqvist formula is canonical, and corresponds to a first-order definable class of Kripke frames. Sahlqvist's definition characterizes a decidable set of modal formulas with first-order correspondents. Since it is undecidable, by Chagrova's theorem, whether an arbitrary modal formula has a first-order correspondent, there are formulas with first-order frame conditions that are not Sahlqvist (1991 ) (see the examples below). Hence Sahlqvist formulas define only a (decidable) subset of modal formulas with first-order correspondents. == Definition == Sahlqvist formulas are built up from implications, where the consequent is ''positive'' and the antecedent is of a restricted form. * A ''boxed atom'' is a propositional atom preceded by a number (possibly 0) of boxes, i.e. a formula of the form (often abbreviated as for ). * A ''Sahlqvist antecedent'' is a formula constructed using ∧, ∨, and from boxed atoms, and negative formulas (including the constants ⊥, ⊤). * A ''Sahlqvist implication'' is a formula ''A'' → ''B'', where ''A'' is a Sahlqvist antecedent, and ''B'' is a positive formula. * A ''Sahlqvist formula'' is constructed from Sahlqvist implications using ∧ and (unrestricted), and using ∨ on formulas with no common variables. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Sahlqvist formula」の詳細全文を読む スポンサード リンク
|